#include <iostream>
#include <string>
using namespace std;

struct Node {
    int key;
    Node *right, *left, *parent;
    Node() = default;
    Node(const int &k, Node *l, Node *r, Node *p): key(k), right(r), left(l), parent(p) {}
};
Node *root, *NIL;
void insert(int k) {
    Node *y = NIL;
    Node *x = root;
    Node *z = new Node(k, NIL, NIL, NIL);
    // 寻找合适插入位置
    while (x != NIL) {
        y = x;
        if (z->key < x->key) x = x->left;
        else x = x->right;
    }
    // 找到合适插入位置
    z->parent = y;
    // 插入
    if (y == NIL) {
        root = z;
    } else {
        if (z->key < y->key) y->left = z;
        else y->right = z;
    }
}
// 搜索二叉树
Node* find(Node *u, int k) {
    while (u != NIL && k != u->key) {
        if (k < u->key) u = u->left;
        else u = u->right;
    }
    return u;
}

Node *treeMinimum(Node *x) {
    while (x->left != NIL) x = x->left;
    return x;
}
Node *treeSuccessor(Node *x) {
    if (x->right != NIL) return treeMinimum(x->right);
    Node *y = x->parent;
    while (y != NIL && x == y->right) {
        x = y;
        y = y->parent;
    }
    return y;
}

void treeDelete(Node *z) {
    Node *y;    // object that need to be removed
    Node *x;    // y's son
    if (z->left == NIL || z->right == NIL) y = z;
    else y = treeSuccessor(z);
    // 确定y的位置
    if (y->left != NIL) 
        x = y->left;
    else
        x = y->right;
    if (x != NIL) x->parent = y->parent;
    if (y->parent == NIL) {
        root = x;
    } else {
        if (y == y->parent->left)
            y->parent->left = x;
        else
            y->parent->right = x;
    }
    if (y != z) z->key = y->key;
    free(y);
}

void inorder(Node *u) {
    if (u == NIL) return;
    inorder(u->left);
    cout << " " << u->key;
    inorder(u->right);
}
void preorder(Node *u) {
    if (u == NIL) return;
    cout << " " << u->key;
    preorder(u->left);
    preorder(u->right);
}
int main() {
    int n, i, x;
    string com;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> com;
        if (com == "insert") {
            cin >> x;
            insert(x);
        } else if (com == "print") {
            inorder(root);
            cout << endl;
            preorder(root);
            cout << endl;
        } else if (com == "find") {
            cin >> x;
            Node *t = find(root, x);
            if (t != NIL) cout << "yes" << endl;
            else cout << "no" << endl;
        } else if (com == "delete") {
            cin >> x;
            treeDelete(find(root, x));
        }
    }
    return 0;
}